Parallel Jacobi methods for derivative-free optimization on parallel or distributed processors
نویسندگان
چکیده
منابع مشابه
Methods for Network Optimization and Parallel Derivative-free Optimization
This thesis is divided into two parts that each is concerned with a specific problem. The problem under consideration in the first part is to find suitable graph representations, abstractions, cost measures and algorithms for calculating placements of unmanned aerial vehicles (UAVs) such that they can keep one or several static targets under constant surveillance. Each target is kept under surv...
متن کاملParallel and Distributed Methods for Nonconvex Optimization-Part I: Theory
In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints. The algorithm solves a sequence of (separable) strongly convex problems and mantains feasibility at each iteration. Convergence to a stationary solution of the original nonconvex optimization is established. Our framework is very general...
متن کاملParallel Hybrid Optimization Methods
Solving efficiently large benchmarks of NP-hard permutation-based problems requires the development of hybrid methods combining different classes of optimization methods. Indeed, it is now acknowledged that such methods perform better than traditional optimization methods when used separately. The key challenge is how to find connections between the divergent search strategies used in each clas...
متن کاملObjective-derivative-free methods for constrained optimization
We propose feasible descent methods for constrained minimization that do not make explicit use of objective derivative information. The methods at each iteration sample the objective function value along a finite set of feasible search arcs and decrease the sampling stepsize if an improved objective function value is not sampled. The search arcs are obtained by projecting search direction rays ...
متن کاملCompiling data-parallel languages for distributed memory multi-processors
This paper introduces a succinct intermediate representation for compiling high-level, data-parallel languages. It is shown how inferences applied to this representation can infer the necessary information to compile it into e cient code. Further inference procedures are being investigated in order to automatically distribute and align data objects on distributed memory multi-processors. The in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ANZIAM Journal
سال: 2005
ISSN: 1445-8810
DOI: 10.21914/anziamj.v46i0.986